Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing

نویسندگان

چکیده

Semiconductor manufacturing systems consist of highly complex and constrained processes owing to the requirement for high-quality wafers dynamic customer orders. This study focuses on waiting time constraints achieve wafers, with missing operations, manufacture different types orders, which are common scheduling requirements in semiconductor systems. Waiting limit times between consecutive machines. Although sequential steps modelled as a flow shop, some jobs can skip shop. Such accordingly certain machines is called ‘missing operations’. research investigates problem shop operations. A mathematical programming formulation algorithms proposed operate such efficiently. Through computational experiments, were evaluated, analysis various parameters operations was conducted.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search

Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...

متن کامل

passivity in waiting for godot and endgame: a psychoanalytic reading

this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...

Flow shop scheduling with multiple operations and time lags

A scheduling system is proposed and developed for a special type of flow shop. In this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j-1 has finished. Preemption of the operations of a job is not allowed. The flow shop that we consider has anothe...

متن کامل

MILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints

In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...

متن کامل

Simultaneous production planning and scheduling in a hybrid flow shop with time periods and work shifts

Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Engineering Optimization

سال: 2022

ISSN: ['1029-0273', '0305-215X', '1026-745X']

DOI: https://doi.org/10.1080/0305215x.2022.2124406